A bijection between words and multisets of necklaces
نویسندگان
چکیده
In [4] has been proved the bijectivity of a natural mapping Φ from words on a totally ordered alphabet onto multisets of primitive necklaces (circular words) on this alphabet. This mapping has many enumerative applications; among them, the fact that the number of permutations in a given conjugation class and with a given descent set is equal to the scalar product of two representations naturally associated to the class and the set. The direct mapping is defined by associating to each word its standard permutation, and then replacing in the cycles of the latter each element by the corresponding letter of the word. The inverse mapping φ−1 is constructed using the lexicographic order of infinite words. In the present article, we replace the standard permutation by the costandard permutation. That is, the permutation obtained by numbering the positions in the word from right to left (instead from left to right as it is done for the standard permutation). This a priori useless generalization has however striking properties. Indeed, it induces a bijection Ξ between words and multisets of necklaces, which are intimately related to the PoincaréBirkhoff-Witt theorem applied to the free Lie superalgebra (instead of the free Lie algebra as it is the case for Φ). See Section 3 for the exact description of these multisets. Another striking property of the bijection Ξ is hat the inverse bijection uses, instead of the lexicographic order, the alternate lexicographic order of infinite words; this means that one compares the first letters of the infinite words for the given order of the alphabet, then if equality, the second letters for the opposite order, and so on. The alternate lexicographic order is very natural. Indeed it corresponds to the order of real numbers given by their expansion into continued fractions. This is well-known and used implicitly very often, see for example the book [3] on the the Markoff and Lagrange spectra. The proof of the bijectivity of Ξ that we give has as a byproduct a new proof of the bijectivity of Φ, that we give in Section 2. In Section 5 we recall the symmetric functions that are induced by Φ, and then show that the symmetric functions induced by Ξ are related to the free Lie superalgebra and equal to the image of the formers under the fundamental involution of symmetric functions.
منابع مشابه
Emulating Primality with Multiset Representations of Natural Numbers
Factorization results in multisets of primes and this mapping can be turned into a bijection between multisets of natural numbers and natural numbers. At the same time, simpler and more efficient bijections exist that share some interesting properties with the bijection derived from factorization. This paper describes mechanisms to emulate properties of prime numbers through isomorphisms connec...
متن کاملDyck paths and a bijection for multisets of hook numbers
We give a bijective proof of a conjecture of Regev and Vershik [7] on the equality of two multisets of hook numbers of certain skew-Young diagrams. The bijection proves a result that is stronger and more symmetric than the original conjecture, by means of a construction involving Dyck paths, a particular type of lattice path.
متن کاملGeneral definitions for the union and intersection of ordered fuzzy multisets
Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...
متن کاملA Gray code for fixed-density necklaces and Lyndon words in constant amortized time
This paper develops a constant amortized time algorithm to produce a cyclic cool-lex Gray code for fixed-density binary necklaces, Lyndon words, and pseudo-necklaces. It is the first Gray code for these objects that achieves this time bound. The algorithm is applied: (i) to develop a constant amortized time cyclic Gray code for necklaces, Lyndon words, and pseudo-necklaces ordered by density an...
متن کاملEfficient Indexing of Necklaces and Irreducible Polynomials over Finite Fields
We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1, . . . , |S|} and the set S of all irreducible, monic, univariate polynomials of degree n over a finite field Fq. This has applications in pseudorandomness, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 33 شماره
صفحات -
تاریخ انتشار 2012